منابع مشابه
A Full Characterization on Fixed-Point Theorem, Minimax Inequality, Saddle Point, and KKM Theorem
This paper provides necessary and sufficient conditions for fixed-point theorems, minimax inequalities and some related theorems defined on arbitrary topological spaces that may be discrete, continuum, non-compact or non-convex. We establish a single condition, γ-recursive transfer lower semicontinuity, which fully characterizes the existence of equilibrium of minimax inequality without imposin...
متن کاملsurvey on the rule of the due & hindering relying on the sheikh ansaris ideas
قاعده مقتضی و مانع در متون فقهی کم و بیش مستند احکام قرار گرفته و مورد مناقشه فقهاء و اصولیین می باشد و مشهور معتقند مقتضی و مانع، قاعده نیست بلکه یکی از مسائل ذیل استصحاب است لذا نگارنده بر آن شد تا پیرامون این قاعده پژوهش جامعی انجام دهد. به عقیده ما مقتضی دارای حیثیت مستقلی است و هر گاه می گوییم مقتضی احراز شد یعنی با ماهیت مستقل خودش محرز گشته و قطعا اقتضاء خود را خواهد داشت مانند نکاح که ...
15 صفحه اولImproving the Performance of Bayesian Estimation Methods in Estimations of Shift Point and Comparison with MLE Approach
A Bayesian analysis is used to detect a change-point in a sequence of independent random variables from exponential distributions. In This paper, we try to estimate change point which occurs in any sequence of independent exponential observations. The Bayes estimators are derived for change point, the rate of exponential distribution before shift and the rate of exponential distribution after s...
متن کاملChange-point estimation from indirect observations 1. Minimax complexity
We consider the problem of nonparametric estimation of signal singularities from indirect and noisy observations. Here by singularity we mean a discontinuity (change– point) of the signal or of its derivative. The model of indirect observations we consider is that of a linear transform of the signal, observed in white noise. The estimation problem is analyzed in a minimax framework. We provide ...
متن کاملAn interior point algorithm for continuous minimax: implementation and computation
In this paper we propose an algorithm for the constrained continuous minimax problem. The algorithm, motivation and numerical experience are reported in this paper. Theoretical properties, and the convergence of the proposed method are discussed in a separate paper[31]. The algorithm uses quasi–Newton search direction, based on sub–gradient information, conditional on maximizers. The initial pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of Mathematical Statistics
سال: 1953
ISSN: 0007-4993
DOI: 10.5109/12958